Product Cordial Labelling of Some Connected Graphs
نویسندگان
چکیده
منابع مشابه
Product Cordial Labeling for Some New Graphs
Received: December 16, 2010 Accepted: December 31, 2010 doi:10.5539/jmr.v3n2p206 Abstract In this paper we investigate product cordial labeling for some new graphs. We prove that the friendship graph, cycle with one chord (except when n is even and the chord joining the vertices at diameter distance), cycle with twin chords (except when n is even and one of the chord joining the vertices at dia...
متن کاملTotally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملSome totally modular cordial graphs
In this paper we define total magic cordial (TMC) and total sequential cordial (TSC) labellings which are weaker versions of magic and simply sequential labellings of graphs. Based on these definitions we have given several results on TMC and TSC graphs.
متن کاملOn k-total edge product cordial graphs
A k-total edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize graphs admitting a 2total edge product cordial labeling. We also show that dense graphs and regular graphs of degree 2(k − 1) admit a k-total edge product cordial labeling.
متن کاملPrime Cordial Labeling of Some Graphs
In this paper we prove that the split graphs of 1,n K and are prime cordial graphs. We also show that the square graph of is a prime cordial graph while middle graph of is a prime cordial graph for . Further we prove that the wheel graph admits prime cordial labeling for . , n n B n , n n B n P 8 4 n
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Research in Applied Science and Engineering Technology
سال: 2017
ISSN: 2321-9653
DOI: 10.22214/ijraset.2017.9212